Providing Multiple Service Classes for Bursty Data

{ This paper evaluates the use of packet scheduling to provide multiple service classes for bursty data traac. In particular, we study the performance of the weighted fair queueing algorithm by simulating various scenarios in a packet cellular wireless network similar to an EDGE system. The results show that, due to the burstiness of data traac, traditional work-conserving packet scheduling algorithms such as weighted fair queueing can not achieve the desired performance unless the system is heavily loaded. Similar results hold even when using priority queueing, which is an extreme form of weighted fair queueing. We also nd that best eeort traac should be managed carefully to avoid ineecient usage of the network, especially in a low capacity cellular environment.